Dense Subsets of Pseudorandom Sets ∗ [ Extended

نویسندگان

  • Omer Reingold
  • Luca Trevisan
  • Madhur Tulsiani
  • Salil Vadhan
چکیده

A theorem of Green, Tao, and Ziegler can be stated (roughly) as follows: ifR is a pseudorandom set, andD is a dense subset of R, then D may be modeled by a set M that is dense in the entire domain such that D and M are indistinguishable. (The precise statement refers to“measures” or distributions rather than sets.) The proof of this theorem is very general, and it applies to notions of pseudorandomness and indistinguishability defined in terms of any family of distinguishers with some mild closure properties. The proof proceeds via iterative partitioning and an energy increment argument, in the spirit of the proof of the weak Szemerédi regularity lemma. The “reduction” involved in the proof has exponential complexity in the distinguishing probability. We present a new proof inspired by Nisan’s proof of Impagliazzo’s hardcore set theorem. The reduction in our proof has polynomial complexity in the distinguishing probability and provides a new characterization of the notion of “pseudoentropy” of a distribution. A proof similar to ours has also been independently discovered by Gowers [2]. We also follow the connection between the two theorems and obtain a new proof of Impagliazzo’s hardcore set theorem via iterative partitioning and energy increment. While our reduction has exponential complexity in some parameters, it has the advantage that the hardcore set is efficiently recognizable. ∗A full version of this paper is available on ECCC [9] and a short exposition of the main theorem is also available on ArXiv [10]. †Research supported by US-Israel Binational Science Foundation Grant 2006060. ‡Work partly done while visiting Princeton University and the IAS. Research supported by the National Science Foundation under grants CCF0515231 and CCF-0729137 and by the US-Israel Binational Science Foundation grant 2006060. §Work done during a visit to U.C. Berkeley, supported by the Miller Foundation for Basic Research in Science and a Guggenheim Fellowship. This materials is also based on work supported by US-Israel Binational Science Foundation under grant 2006060, and the Office of Naval Research under grant N00014-04-1-0478.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some points on generalized open sets

The paper is an attempt to represent a study of limit points, boundary points, exterior points, border, interior points and closure points in the common generalized topological space. This paper takes a look at the possibilities of an extended topological space and it also considers the new characterizations of dense set.

متن کامل

Large Families of Pseudorandom Subsets Formed by Power Residues

In an earlier paper the authors introduced the measures of pseudorandomness of subsets of the set of the positive integers not exceeding N , and they also presented two examples for subsets possessing strong pseudorandom properties. One of these examples included permutation polynomials f(X) ∈ Fp[X] and d-powers in Fp. This construction is not of much practical use since very little is known on...

متن کامل

Sparse Pseudorandom Objects

It has been known for a long time that many mathematical objects can be naturally decomposed into a ‘pseudorandom’, chaotic part and/or a highly organized ‘periodic’ component. Theorems or heuristics of this type have been used in combinatorics, harmonic analysis, dynamical systems and other parts of mathematics for many years, but a number of results related to such ‘structural’ theorems emerg...

متن کامل

Department of Computer Science Spring 2008 9 Course 236610 : Research Laboratory in Theoretical Computer Science

Preface In our research laboratory we plan to study selected results from the eld of additive com-binatorics and some of their applications to theoretical computer science. A tentative list of results includes • Roth's Theorem about the existence of arithmetic progressions of length 3 in dense subsets of Z m p. • The Gowers norm and Samorodnitsky's Theorem about testing quadratic functions over...

متن کامل

Construction of large families of pseudorandom subsets using elliptic curves

Recently, Dartyge and Sárközy investigated the measures, i.e., the well distribution measure and the correlation measure of order k, of pseudorandomness of subsets of the set {1, 2, . . . ,N}, and they presented several constructive examples for subsets with strong pseudorandom properties when N is a prime number. In this article, we present a construction of pseudorandom subsets using elliptic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008